Protecting co-operating mobile agents against malicious hosts

We propose a security model for open multi-agent systems. Given a user-defined task T, we generate a set of mobile agents which realize a common functionality that solves T. Those agents co-operate with each other and build an autonomous community. Using a scheme for secure distributed computations, this community is able to perform secure computations without requiring interaction with a trusted party. For this paper, we have chosen Canetti\u27s model for secure multi-party computations. Unfortunately, the problems arising from the migration of agents are not covered by this technique. We present an extended model that offers a solutions to this. Thus, we yield guarantees for confidentiality of secret data, detection of unauthorised code and data changes, reestablishment of corrupted agents and prevention from malicious routing

Possible attacks on and countermeasures for secure multi-agent computation

In this paper we improve the model for secure multi-agent computation proposed by Endsuleit and Mie. We apply a recent protocol from Hirt and Maurer for secure multi-party computation to build Alliances of n agents that solve a common task. The protocol used is very efficient with a communication load of O(n^2 m) (where m is the number of multiplications). All computations within the Alliance are robust as less than n/3 agents are corrupted at the same time

State of the art in electronic ticketing

Seit einigen Jahren wird das Thema Electronic Ticketing immer populaerer. Eine Vielzahl von Projekten mit unterschiedlichen Strategien, die alle zum Ziel haben, das bargeldlose Bezahlen mit einer Smart Card in den oeffentlichen Personennahverkehr einzufuehren, wurde ins Leben gerufen. Es stellte sich heraus, dass es ausgeprochen schwierig ist, an detailierte Informationen ueber diese Projekte zu kommen. Dies ist vermutlich begruendet in dem harten Konkurrenzkampf, der in diesem Gebiet herrscht.Aus diesem Grund stellen wir in diesem Report die vier wichtigsten Strategien sowie einige expemplarische Projekte vor. Desweiteren wird ein Ueberblick ueber die weltweiten Aktivitaeten auf diesem Gebiet gegeben

An Agent framework for Legal Validation of E-Transactions

E-business requires trust in business partners and in technologies. The forme

Secure Multi-Agent Computations

We propose a security model for open multi-agent systems. Given a user-defined task T , we generate a group of mobile agents which realise a common functionality that solves T . Those agents cooperate with each other and build an autonomous community. Using a scheme for secure distributed computations, this community is able to perform secure computations without requiring interaction with a trusted party. To get some formal security guarantees we incorporate Canetti's model for secure multi-party computations (see [6]) into the agent setting. Canetti's model assumes stationary parties and so does not cover the agents' migration process. But we will present a solution to this. Thus, we yield guarantees for code, data and execution integrity, data privacy and prevention from malicious routing. Key Words: Distributed Computations, Security Model, MultiAgent Systems 1

A multiagent Model for Secure and Scalable E-business Transactions

International audienc

A Multi-Agent Model for Secure and Scalable E-Business Transactions

Abstract. E-business applications require not only effective security mechanisms but also sufficient system resources to make them fast and reliable. We propose an e-business model that is highly decentralized and robust against attacks. The model is well suited for distributed environments like a Grid and is based on a multi-agent system. This underlying multi-agent system relies upon a fully generic approach called Agent-Oriented Abstraction. This enables to define different needs and requirements of an e-business model that are then assigned to decentralized instances like e.g. an instance supporting contract negotiations. Security features support the agents contributing to this e-business model with regard to legal aspects of their contract negotiations. One such feature is achieved by using so-called agent Alliances. Since an Alliance uses secure multi-party computations an instance that is realized by an Alliance of n agents is robust against up to n/3-corrupted members. The main other characteristics of our model are as follows: corporate knowledge is defined through distributed virtual knowledge owned by the agents, the utility of decisions is assessed through a choice of models and trust is achieved through security and legal validation